Quadro: a Supervised Dimension Reduction Method via Rayleigh Quotient Optimization.

نویسندگان

  • Jianqing Fan
  • Zheng Tracy Ke
  • Han Liu
  • Lucy Xia
چکیده

We propose a novel Rayleigh quotient based sparse quadratic dimension reduction method-named QUADRO (Quadratic Dimension Reduction via Rayleigh Optimization)-for analyzing high-dimensional data. Unlike in the linear setting where Rayleigh quotient optimization coincides with classification, these two problems are very different under nonlinear settings. In this paper, we clarify this difference and show that Rayleigh quotient optimization may be of independent scientific interests. One major challenge of Rayleigh quotient optimization is that the variance of quadratic statistics involves all fourth cross-moments of predictors, which are infeasible to compute for high-dimensional applications and may accumulate too many stochastic errors. This issue is resolved by considering a family of elliptical models. Moreover, for heavy-tail distributions, robust estimates of mean vectors and covariance matrices are employed to guarantee uniform convergence in estimating non-polynomially many parameters, even though only the fourth moments are assumed. Methodologically, QUADRO is based on elliptical models which allow us to formulate the Rayleigh quotient maximization as a convex optimization problem. Computationally, we propose an efficient linearized augmented Lagrangian method to solve the constrained optimization problem. Theoretically, we provide explicit rates of convergence in terms of Rayleigh quotient under both Gaussian and general elliptical models. Thorough numerical results on both synthetic and real datasets are also provided to back up our theoretical results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quadro: a Supervised Dimension Reduction Method via Rayleigh Quotient Optimization By

We propose a novel Rayleigh quotient based sparse quadratic dimension reduction method—named QUADRO (Quadratic Dimension Reduction via Rayleigh Optimization)—for analyzing high-dimensional data. Unlike in the linear setting where Rayleigh quotient optimization coincides with classification, these two problems are very different under nonlinear settings. In this paper, we clarify this difference...

متن کامل

For “ Quadro : a Supervised Dimension Reduction Method via Rayleigh Quotient Optimization

Lemma A.1. If U follows a uniform distribution on Sd−1, for any d×d diagonal matrix S and any vector β ∈ Rd, we have • E(U>SU) = tr(S) d , E[(U >SU)2] = 2 tr(S 2)+[tr(S)]2 d2+2d ; • E(U>β) = 0, E[(U>β)2] = ‖β‖ 2 d ; • E(U>SUU>β) = 0. Now, we show the claim of Proposition 2.1. Let Y = Σ−1/2(Z −μ), then Y = ξU where U follows a uniform distribution on Sd−1 and is independent of ξ. The quadratic f...

متن کامل

Robust and Efficient Computation of Eigenvectors in a Generalized Spectral Method for Constrained Clustering

FAST-GE is a generalized spectral method for constrained clustering [Cucuringu et al., AISTATS 2016]. It incorporates the mustlink and cannot-link constraints into two Laplacian matrices and then minimizes a Rayleigh quotient via solving a generalized eigenproblem, and is considered to be simple and scalable. However, there are two unsolved issues. Theoretically, since both Laplacian matrices a...

متن کامل

Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems

A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is proposed to evaluate the leftmost eigenpairs of the generalized symmetric positive definite eigenproblem. The minimization is performed via a conjugate gradient-like procedure accelerated by a factorized approximate inverse preconditioner (FSAI) and by a number of block preconditioners. The resulting cod...

متن کامل

Geometric Optimization Methods for Adaptive Filtering

The techniques and analysis presented in this thesis provide new methods to solve optimization problems posed on Riemannian manifolds. These methods are applied to the subspace tracking problem found in adaptive signal processing and adaptive control. A new point of view is offered for the constrained optimization problem. Some classical optimization techniques on Euclidean space are generalize...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annals of statistics

دوره 43 4  شماره 

صفحات  -

تاریخ انتشار 2015